Some remarks on the inverse Smoluchowski problem for cluster-cluster aggregation

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Some remarks on inverse Wiener index problem

The sum of distances between all pairs of vertices W (G) in a connected graph G as a graph invariant was first introduced by Wiener [9] in 1947. He observed a correlation between boiling points of paraffins and this invariant, which has later become known as Wiener index of a graph. Today, the Wiener index is one of the most widely used descriptors in chemical graph theory. Due to its strong co...

Interpolating time series based on fuzzy cluster analysis problem

This study proposes the model for interpolating time series to use them  to forecast effectively for future. This model is established based on the improved fuzzy clustering analysis problem, which is implemented by the Matlab procedure. The proposed model is illustrated by a data set and tested for many other datasets, especially for 3003 series in  M3-Competition data. Comparing  to the exist...

Persistence in cluster-cluster aggregation.

Persistence is considered in one-dimensional diffusion-limited cluster-cluster aggregation when the diffusion coefficient of a cluster depends on its size s as D(s) approximately s(gamma). The probabilities that a site has been either empty or covered by a cluster all the time define the empty and filled site persistences. The cluster persistence gives the probability of a cluster remaining int...

Remarks on the Pegasus Cluster of Nebulae.